Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
نویسنده
چکیده
Two simple and work e cient parallel algorithms for the minimum spanning tree problem are presented Both algorithms perform O m log n work The rst algorithm runs in O log n time on an EREW PRAM while the second algorithm runs in O logn time on a Common CRCW PRAM
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملPractical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p is the number of processors. For this case, we show that simple algorithms with dataindependent communication patterns are efficient, both in theory and in practice. The algorithms are evaluated theoretically using Va...
متن کاملSimple parallel algorithms for the replacement edge problem and related problems on spanning trees
Let G be a connected, undirected, and weighted graph with n vertices and m edges. Further, let S be a spanning tree of G and T a minimum spanning tree of G. In this paper we present parallel algorithms for solving the following problems: (a) Given G and T , for each edge e of T , determine a replacement edge f by which e should be replaced to create a new minimum spanning tree if e is removed f...
متن کاملOptimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree
The vertex updating problem for a minimum spanning tree (MST) is deened as follows: Given a graph G = (V; E G) and its MST T, update T when a new vertex z is introduced along with weighted edges that connect z with the vertices of G. We present a set of rules that, together with a valid tree-contraction schedule , are used to produce simple optimal parallel algorithms that run in O(lgn) paralle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 7 شماره
صفحات -
تاریخ انتشار 1997